منابع مشابه
Paramodulation with Well-founded Orderings
For many years, all existing completeness results for KnuthBendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By u...
متن کاملWell-Founded Recursive Relations
We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting à la Ferreira-Zantema and a wellfounded relation .. This construction generalizes several variants of the recursive path ordering on terms and of the Knuth-Bendix ordering. It also applies to other domains, of graphs, of infinite terms, of word and tree automata notably. We then exte...
متن کاملWell-founded Path Orderings for Operads
The definition herein of the Graph Path Ordering (GPO) on certain graph expressions is inspired by that of the Recursive Path Ordering (RPO), and enjoys all those properties that have made RPO popular, in particular, well-foundedness and monotonicity on variable-free terms. We are indeed interested in a generalization of algebraic expressions called operadic expressions, which are finite graphs...
متن کاملImplementation in Acl2 of Well-Founded Polynomial Orderings
This paper presents how the development of a polynomial ordering and the veri cation of its properties can be t in the framework of Acl2. The key result is the well-foundedness of a polynomial ordering, which is proved by a proper ordinal embedding. Normalized polynomials have been formalized to achieve this. The motivation for this work is to serve as a basis for proving the termination of cer...
متن کاملA non-well-founded primitive recursive tree provably well-founded for co-r.e. sets
We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ01-IND. It follows that the supremum of order-types of primitive recursive wellorderings, whose well-foundedness on co-r.e. sets is provable in Σ01-IND, equals the limit of all recursive ordinals ω 1 . This work contributes to the investigation of replacing the quant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1978
ISSN: 0003-4843
DOI: 10.1016/0003-4843(78)90001-3